Path Maximum Query and Path Maximum Sum Query in a Tree
نویسندگان
چکیده
منابع مشابه
Path Maximum Query and Path Maximum Sum Query in a Tree
Let T be a node-weighted tree with n nodes, and let π(u, v) denote the path between two nodes u and v in T . We address two problems: (i) Path Maximum Query: Preprocess T so that, for a query pair of nodes u and v, the maximum weight on π(u, v) can be found quickly. (ii) Path Maximum Sum Query: Preprocess T so that, for a query pair of nodes u and v, the maximum weight sum subpath of π(u, v) ca...
متن کاملPath Query
DEFINITION Given a semi-structured data set D, a path query identifies nodes of interest by specifying the path lead to the nodes and the predicates associated with nodes along the path. The path is identified by specifying the labels of the nodes to be navigated and structural relationship (parent-child or ancestor-descendant) among the nodes. A predicate can be a path query itself, relative t...
متن کاملFinding a Length-Constrained Maximum-Density Path in a Tree
Let T = (V, E, w) be an undirected and weighted tree with node set V and edge set E , where w(e) is an edge weight function for e ∈ E . The density of a path, say e1, e2, . . . , ek , is defined as ∑k i=1 w(ei )/k. The length of a path is the number of its edges. Given a tree with n edges and a lower bound L where 1 ≤ L ≤ n, this paper presents two efficient algorithms for finding a maximum-den...
متن کاملMaximum Rank Query
The top-k query is a common means to shortlist a number of options from a set of alternatives, based on the user’s preferences. Typically, these preferences are expressed as a vector of query weights, defined over the options’ attributes. The query vector implicitly associates each alternative with a numeric score, and thus imposes a ranking among them. The top-k result includes the k options w...
متن کاملOn the Range Maximum-Sum Segment Query Problem
We are given a sequence A of n real numbers which is to be preprocessed. In the Range Maximum-Sum Segment Query (RMSQ) problem, a query is comprised of two intervals [i, j] and [k, l] and our goal is to return the maximum-sum segment of A whose starting index lies in [i, j] and ending index lies in [k, l]. We propose the first known algorithm for this problem in O(n) preprocessing time and O(1)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2009
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e92.d.166